Sparse recovery by non-convex optimization – instance optimality
نویسندگان
چکیده
منابع مشابه
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on lp minimization with 0 < p < 1 to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [4] and Wojtaszczyk [30] regarding the decoder ∆1, based on l 1 minimization, to ∆p with 0...
متن کاملSparse Recovery by Non - Convex Optimization –
In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on ℓ p minimization with p ∈ (0, 1) to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [3] and Wojtaszczyk [30] regarding the decoder ∆ 1 , based on ℓ 1 minimization, to ∆p wi...
متن کاملBlind Sensor Calibration in Sparse Recovery Using Convex Optimization
Abstract—We investigate a compressive sensing system in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on a few unknown (but sparse) signals. We extend our earlier study on real positive gains to two generalized cases (signed real-valued gains; complex-valued gains), and show that the recovery of...
متن کاملA Non-convex Approach for Sparse Recovery with Convergence Guarantee
In the area of sparse recovery, numerous researches hint that non-convex penalties might induce better sparsity than convex ones, but up until now the non-convex algorithms lack convergence guarantee from the initial solution to the global optimum. This paper aims to provide theoretical guarantee for sparse recovery via non-convex optimization. The concept of weak convexity is incorporated into...
متن کاملAdaptive Recovery of Signals by Convex Optimization
We present a theoretical framework for adaptive estimation and prediction of signals of unknown structure in the presence of noise. The framework allows to address two intertwined challenges: (i) designing optimal statistical estimators; (ii) designing efficient numerical algorithms. In particular, we establish oracle inequalities for the performance of adaptive procedures, which rely upon conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2010
ISSN: 1063-5203
DOI: 10.1016/j.acha.2009.08.002